Streamlined solutions to multilevel sparse matrix problems
نویسندگان
چکیده
منابع مشابه
Global Astrometric Solutions with Sparse Matrix Techniques
Modern astrometric techniques lead to large, linear systems solved by the precepts of least-squares. These systems are usually sparse, and one should take advantage of the sparsity to facilitate their solution. As long as the matrix A of the equations of condition possesses the weak Hall property, characteristic of linear systems derived from astrometric reductions, it is possible to nd a spars...
متن کاملSparse solutions to random standard quadratic optimization problems
The standard quadratic optimization problem (StQP) refers to the problem of minimizing a quadratic form over the standard simplex. Such a problem arises from numerous applications and is known to be NP-hard. In this paper we focus on a special scenario of the StQP where all the elements of the data matrix Q are independently identically distributed and follow a certain distribution such as unif...
متن کاملSparse solutions for linear prediction problems
Simplicity is the ultimate sophistication. -Leonardo da Vinci The simplicity of an idea has long been regarded as a sign of elegance and, when shown to coincide with accuracy, a hallmark of profundity. In this thesis our ideas are vectors used as predictors, and sparsity is our measure of simplicity. A vector is sparse when it has few nonzero elements. We begin by asking the question: given a m...
متن کاملSparse solutions of linear complementarity problems
This paper considers the characterization and computation of sparse solutions and leastp-norm (0 < p < 1) solutions of the linear complementarity problems LCP(q,M). We show that the number of non-zero entries of any least-p-norm solution of the LCP(q,M) is less than or equal to the rank of M for any arbitrary matrix M and any number p ∈ (0, 1), and there is p̄ ∈ (0, 1) such that all least-p-norm...
متن کاملA geometric framework for sparse matrix problems
In this paper, we set up a geometric framework for solving sparse matrix problems. We introduce geometric sparseness, a notion which applies to several well-known families of sparse matrix. Two algorithms are presented for solving geometrically-sparse matrix problems. These algorithms are inspired by techniques in classical algebraic topology, and involve the construction of a simplicial comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2020
ISSN: 1445-8810
DOI: 10.21914/anziamj.v62i0.14621